Linearity is strictly more powerful than contiguity for encoding graphs
نویسندگان
چکیده
منابع مشابه
Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs
Linearity and contiguity are two parameters devoted to graph encoding. Linearity is a generalisation of contiguity in the sense that every encoding achieving contiguity k induces an encoding achieving linearity k, both encoding having size Θ(k.n), where n is the number of vertices of G. In this paper, we prove that linearity is a strictly more powerful encoding than contiguity, i.e. there exist...
متن کاملUnchecked Exceptions Can Be Strictly More Powerful Than Call/CC
We demonstrate that in the context of statically-typed purely-functional lambda calculi without recursion, unchecked exceptions (e.g., SML exceptions) can be strictly more powerful than call/cc. More precisely, we prove that a natural extension of the simply-typed lambda calculus with unchecked exceptions is strictly more powerful than all known sound extensions of Girard’s Fω (a superset of th...
متن کاملExceptions Are Strictly More Powerful Than Call/CC
We demonstrate that in the context of statically typed pure functional lambda calculi, exceptions are strictly more powerful than call/cc. More precisely, we prove that the simply typed lambda calculus extended with exceptions is strictly more powerful than Girard's F ! [6, 15] (a superset of the simply typed lambda calculus) extended with call/cc and abort. This result is established by showin...
متن کاملIt's a Tough Nanoworld: in Tile Assembly, Cooperation is not (strictly) more Powerful than Competition
We present a strict separation between the class of “mismatch free” self-assembly systems and general aTAM systems. Mismatch free systems are those systems in which concurrently grown parts must always agree
متن کاملMonotone switching networks for directed connectivity are strictly more powerful than certain-knowledge switching networks
L (Logarithmic space) versus NL (Non-deterministic logarithmic space) is one of the great open problems in computational complexity theory. In the paper “Bounds on monotone switching networks for directed connectivity”, we separated monotone analogues of L and NL using a model called the switching network model. In particular, by considering inputs consisting of just a path and isolated vertice...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2016
ISSN: 0012-365X
DOI: 10.1016/j.disc.2016.03.006